Chain substitution and successive approximation method: Throughput analysis at SMEs

A Successive Minima Method for Implicit Approximation

This paper is concerned with the problem of approximating a collection of unorganized data points by an algebraic tensor-product B-spline curve. The implicit approximation to data points would be ideally based on minimizing the sum of squares of geometric distance. Since the geometric distance from a point to an implicit curve cannot be computed analytically, Sampson distance, which is the firs...

A Novel Successive Approximation Method for Solving a Class of Optimal Control Problems

This paper presents a successive approximation method (SAM) for solving a large class of optimal control problems. The proposed analytical-approximate method, successively solves the Two-Point Boundary Value Problem (TPBVP), obtained from the Pontryagin's Maximum Principle (PMP). The convergence of this method is proved and a control design algorithm with low computational complexity is present...

0 One Form of Successive Approximation Method and Choice Problem

Parsing by Successive Approximation

It is proposed to parse feature structure-based grammars in several steps. Each step is aimed to eliminate as many invalid analyses as possible as e ciently as possible. To this end the set of feature constraints is divided into three subsets, a set of context-free constraints, a set of ltering constraints and a set of structure-building constraints, which are solved in that order. The best pro...

Deinterlacing by successive approximation

We propose an algorithm for deinterlacing of interlaced video sequences. It successively builds approximations to the deinterlaced sequence by weighting various interpolation methods. A particular example given here uses four interpolation methods, weighted according to the errors each one introduces. Due to weighting, it is an adaptive algorithm. It is also time-recursive, since the motion-com...